Knight move for chromatic graph cohomology

نویسندگان

  • Michael Chmutov
  • Sergei Chmutov
  • Yongwu Rong
چکیده

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. HelmeGuizon and Y. Rong. Namely, for a connected graph Γ with n vertices the only non-trivial cohomology groups H(Γ), H(Γ) come in isomorphic pairs: H(Γ) = H(Γ) for i > 0 if Γ is non-bipartite, and for i > 0 if Γ is bipartite. As a corollary, the ranks of the cohomology groups are determined by the chromatic polynomial. At the end, we give an explicit formula for the Poincaré polynomial in terms of the chromatic polynomial and a deletion-contraction formula for the Poincaré polynomial. Introduction Recently, motivated by the Khovanov cohomology in knot theory [Kho], Laure Helme-Guizon and Yongwu Rong [HGR1] developed a bigraded cohomology theory for graphs. Its main property is that the Euler characteristic with respect to one grading and the Poincaré polynomial with respect to the other grading give the chromatic polynomial of the graph. There is a long exact sequence relating the cohomology of a graph with the cohomologies of graphs obtained from it by contraction and deletion of an edge. It generalizes the classical contraction-deletion rule for the chromatic polynomial. This sequence is an important tool in proving various properties of the cohomology (see [HGR1]). In particular, for a connected graph Γ with n vertices, it allows to prove that the cohomologies are concentrated on two diagonals H(Γ) and H(Γ). We prove that H(Γ) is isomorphic to H(Γ) (“knight move”) for all i with the exception of i = 0 for a bipartite graph Γ. An analogous theorem for Khovanov cohomology in knot theory was proved in [Lee]. Our proof follows the same idea of considering an additional differential Φ on the chromatic cochain complex of the graph Γ. The associated spectral sequence collapses at the term E2, and so this term is given by the cohomologies of Γ with respect to the differential Φ+d. They turn out to be trivial with a small exception. On the other hand, the term E1 of the spectral sequence is represented by the cohomology of our graph with the differential Φ. So Φ gives the desired isomorphism. Its existence implies that the chromatic

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knight move in chromatic cohomology

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. HelmeGuizon and Y. Rong. Namely, for a connected graph Γ with n vertices the only non-trivial cohomology groups H(Γ), H(Γ) come in isomorphic pairs: H(Γ) = H(Γ) for i > 0 if Γ is non-bipartite, and for i > 0 if Γ is bipartite. As a corollary, the ranks of the cohomolog...

متن کامل

Chromatic polynomials of some nanostars

Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.

متن کامل

The distinguishing chromatic number of bipartite graphs of girth at least six

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

متن کامل

Just chromatic exellence in fuzzy graphs

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

متن کامل

A new result on chromaticity of K4-homoemorphs with girth 9

For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008